Timed model-based testing
نویسندگان
چکیده
Testing is one of the most natural, intuitive and widely used methods to check the quality of software. One of the emerging and promising techniques for test automation is model-based testing. In model based testing, a model of the desired behavior of the implementation under test (IUT) is the starting point for test generation. In addition, this model serves as the oracle for test result analysis. Large amounts of test cases can, in principle, be algorithmically and automatically generated from the model. Most model-based testing methods deal with black-box testing of functionality. This implies that the kind of properties being tested concern the functionality of the system. Functionality properties express whether the system correctly does what it should do in terms of correct responses to given stimuli, as opposed to, e.g., performance, usability, or reliability properties. In black-box testing, the specification is the starting point for testing. The specification prescribes what the IUT should do, and what it should not do, in terms of the behavior observable at its external interfaces. The IUT is seen as a black box without internal detail, as opposed to white-box testing, where the internal structure of the IUT, such as the program code, is the basis for testing. In this chapter we will consider black-box software testing of functionality properties. Model-based testing should be based on formal methods: methods which allow the precise, mathematical definition of the meaning of models, and of notions of correctness of implementations with respect to specification models. One of the formal theories for model-based testing uses labeled transition systems (LTS) with inputs and outputs as models, and a formal implementation relation called ioco for defining conformance between an IUT and a specification [117, 118]; see also Chapter 11. An
منابع مشابه
Debugging with Timed Automata Mutations
Model-based Debugging is an application of Model-based Diagnosis techniques to debugging computer systems. Its basic principle is to compare a model, i.e., a description of the correct behaviour of a system, to the observed behaviour of the system. In this paper we show how this technique can be applied in the context of model-based mutation testing (MBMT) with timed automata. In MBMT we automa...
متن کاملOnline Testing of Real-Time Systems Using UPPAAL: Status and Future Work
We present the development of T-UPPAAL — a new tool for online black-box testing of real-time embedded systems from non-deterministic timed automata specifications. It is based on a sound and complete randomized online testing algorithm and is implemented using symbolic state representation and manipulation techniques. We propose the notion of relativized timed input/output conformance as the f...
متن کاملTime for Mutants - Model-Based Mutation Testing with Timed Automata
Model-based testing is a popular technology for automatic and systematic test case generation (TCG), where a system-under-test (SUT) is tested for conformance with a model that specifies its intended behavior. Model-based mutation testing is a specific variant of modelbased testing that is fault-oriented. In mutation testing, the test case generation is guided by a mutant, an intentionally alte...
متن کاملModel-based Mutation Testing with Timed Automata
Model-based testing is a popular technology for automatic and systematic test case generation (TCG), where a system-under-test (SUT) is tested for conformance with a model that specifies its intended behavior. Model-based mutation testing is a specific variant of modelbased testing that is fault-oriented. In mutation testing, the test case generation is guided by a mutant, an intentionally alte...
متن کاملTimed Model-Based Conformance Testing A Case Study Using Tron Testing Key States of Automated Trust Anchor Updating (RFC 5011) in Autotrust Bachelor Thesis
We investigate the usability of Timed Model-Based Testing in a case study: Conformance of the implementation Autotrust with Automatic Trust Anchor Updating, a protocol to help securing DNS. We present models for timing aspects of the protocol. Definition of checks on quiescence in the model are proven to be possible. Latency during input application can yield false test results. We present a mo...
متن کاملTesting timed automata
We present a generalization of the classical theory of testing for Mealy machines to a setting of dense real-time systems. A model of timed I/O automata is introduced, inspired by the timed automaton model of Alur and Dill, together with a notion of test sequence for this model. Our main contribution is a test suite derivation algorithm for black-box conformance testing of timed I/O automata. I...
متن کامل